public class test {
    public static void main(String[] args) {
        Float a = new Float(1.0);
        float b = 3.0F;
        System.out.println(a);
        System.out.println(b);
        char ch = '\u0639';

    }
    public static void main1(String[] args) {
        MyBinaryTree tree = new MyBinaryTree();
        MyBinaryTree.treeNode root = tree.createBinaryTree();
        tree.preOrder(root);
        System.out.println();
        tree.preOrderNor(root);
        System.out.println();
        System.out.println("=========中序=========");
        tree.inOrder(root);
        System.out.println();
        System.out.println("=========后序=========");
        tree.postOrder(root);
        tree.postOrderNor(root);
        System.out.println();
        tree.levelOrder(root);

        System.out.println(tree.isCompleteTree(root));


//        //节点个数
//        tree.size(root);
//        System.out.println(MyBinaryTree.nodeSize);
//        System.out.println(tree.size2(root));
//
//        //叶子节点个数
//        tree.getLeafNodeCount(root);
//        System.out.println(MyBinaryTree.leafSize);
//        System.out.println(tree.getLeafNodeCount2(root));
//
//        //获得第K层节点个数
//        System.out.println(tree.getKLevelNodeCount(root,2));
//
//        //获得树的高度
//        System.out.println(tree.getHeight(root));
//
//        //判断val值是否存在
//        System.out.println(tree.find(root,'A').val);
//        System.out.println(tree.find(root,'Z'));

    }
}
